Fold and Mycielskian on homomorphism complexes

نویسنده

  • Péter Csorba
چکیده

Homomorphism complexes were introduced by Lovász to study topological obstructions to graph colorings. We show that folding in the second parameter of the homomorphism complex yields a homotopy equivalence. We study how the Mycielski construction changes the homotopy type of the homomorphism complex. We construct graphs showing that the topological bound obtained by odd cycles can be arbitrarily worse than the bound provided by Hom(K2, G).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph

Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of simila...

متن کامل

Generalised Mycielski Graphs as Topological Cliques

We prove that the coindex of the box complex B(H) of a graph H can be measured by the generalised Mycielski graphs which admit a homomorphism to it. As a consequence, we exhibit for every graph H a system of linear equations solvable in polynomial time, with the following properties: If the system has no solutions, then coind(B(H)) + 2 ≤ 3; if the system has solutions, then χ(H) ≥ 4.

متن کامل

Degree distance index of the Mycielskian and its complement

In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.

متن کامل

Generalised Mycielski Graphs and Bounds on Chromatic Numbers

We prove that the coindex of the box complex B(H) of a graph H can be measured by the generalised Mycielski graphs which admit a homomorphism to it. As a consequence, we exhibit for every graph H a system of linear equations solvable in polynomial time, with the following properties: If the system has no solutions, then coind(B(H))+2 ≤ 3; if the system has solutions, then χ(H) ≥ 4. We generalis...

متن کامل

Second symmetric powers of chain complexes

We investigate Buchbaum and Eisenbud's construction of the second symmetric power $s_R(X)$ of a chain complex $X$ of modules over a commutative ring $R$. We state and prove a number of results from the folklore of the subject for which we know of no good direct references. We also provide several explicit computations and examples. We use this construction to prove the following vers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Contributions to Discrete Mathematics

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2008